Process Algebra and Hoare's Logic

نویسنده

  • Alban Ponse
چکیده

A Hoare-like logic is introduced for deriving`partial correctness assertions' of the form fg p fg, where ; are unary predicates over some state space S and p is an expression over a recursive, non-uniform language containing global nondeterminism (+) and sequential composition (). This logic is (relatively) complete if only guarded recursion is considered.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A THEORY OF ASY } ' iCHRONOUS PROCESSES

A theory of asynchronous processes (nondeterministic data florv net-rvorks) is presented. It consists of a mathematical model and a process algebra. The intention is to provide a better theoretical underpinning to the Jackson System Development metirod. The model is so constructed as to be compatible rvith the failures modei of Hoare's Communicating Sequential Processes. The process algebra des...

متن کامل

An Algebraic Approach to Temporal Logic

A b s t r a c t . The sequential calculus is an algebraic calculus, intended for reasoning about phenomena with a duration and their sequencing. It can be specialized to various domains used for reasoning about programs and systems, including Tarski's calculus of binary relations, Kleene's regular expressions, Hoare's CSP and Dijkstra's regularity calculus. In this paper we use the sequential c...

متن کامل

EQ-logics with delta connective

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

متن کامل

Verification Tools in the Development of Provably Correct Compilers

The paper presents a practical veriication tool that helps in the development of provably correct compilers. The tool is based on the approach of proving termination of PROLOG-like programs using term-rewriting techniques and a technique of testing whether a given PROLOG program can be soundly executed on PROLOG interpreters without the Occur-check test. The tool has been built on top of the th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007